The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. SODA 2012

Source URL: www.math.washington.edu

• Algorithms
• Randomized rounding
• Rounding
• Matrix
• Entropy
• Mathematics
• Computer science
• Applied mathematics

Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer

Source URL: disco.ethz.ch

• Routing
• Approximation algorithm
• Binary trees
• Computing
• Coding theory
• Routing algorithms
• Discrete mathematics

Adaptive Approximation by Greedy Algorithms Albert Cohen University of Paris VI (France) This talk will discuss computational algorithms that deal with the following general task: given a function f and a dictionary of f

Source URL: math.nyu.edu

Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Routing algorithms
• Edsger W. Dijkstra
• Combinatorial optimization
• Search algorithms
• Game artificial intelligence
• A* search algorithm
• Shortest path problem
• Flow network
• Tree
• Graph

The Maximum Hypervolume Set Yields Near-optimal Approximation Karl Bringmann Tobias Friedrich

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Mathematical optimization
• Multi-objective optimization
• Base
• Approximation algorithms
• Mathematics

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Approximation algorithms
• Computational hardness assumptions
• Polynomial-time approximation scheme
• Time complexity
• NC
• Reduction
• Exponential time hypothesis
• NP-hardness
• NP

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Marina Papatriantafilou Happier times in Iceland,

Source URL: www.cse.chalmers.se

• Mathematics
• Discrete mathematics
• Matching
• Combinatorics
• Cooperative games
• Game theory
• Combinatorial optimization
• Preference
• Stable marriage problem

Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann Tobias Friedrich

Source URL: people.mpi-inf.mpg.de

• Mathematical analysis
• Mathematics
• Approximation algorithms
• Polynomial-time approximation scheme
• Pi
• NP-hard problems
• -net

CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014

Source URL: theory.stanford.edu

• Computational complexity theory
• Theory of computation
• Operations research
• Complexity classes
• Combinatorial optimization
• Analysis of algorithms
• Knapsack problem
• Simplex algorithm
• Time complexity
• Optimization problem
• NP
• Polynomial-time approximation scheme

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

Source URL: www.cse.chalmers.se

• Graph theory
• Mathematics
• Combinatorial optimization
• Computational complexity theory
• Routing algorithms
• Search algorithms
• Operations research
• Matching
• A* search algorithm
• Flow network